NTRU: A Ring-Based Public Key Cryptosystem
نویسندگان
چکیده
We describe NTRU, a new public key cryptosystem. NTRU features reasonably short, easily created keys, high speed, and low memory requirements. NTRU encryption and decryption use a mixing system suggested by polynomial algebra combined with a clustering principle based on elementary probability theory. The security of the NTRU cryptosystem comes from the interaction of the polynomial mixing system with the independence of reduction modulo two relatively prime integers p and q.
منابع مشابه
QTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملMaTRU: A New NTRU-Based Cryptosystem
In this paper, we propose a new variant of the NTRU public key cryptosystem − the MaTRU cryptosystem. MaTRU works under the same general principles as the NTRU cryptosystem, except that it operates in a different ring with a different linear transformation for encryption and decryption. In particular, it operates in the ring of k by k matrices of polynomials in R = Z[X]/(X−1), whereas NTRU oper...
متن کاملPairTRU: Pairwise Non-commutative Extension of The NTRU Public key Cryptosystem
We show a novel lattice-based scheme (PairTRU) which is a non-commutative variant of the NTRU. The original NTRU is defined via the ring of quotient with variable in integers and this system works in the ring R = Z[x] . We extend this system over Z× Z and it performs all of operations in the non-commutative ring M = M(k,Z×Z)[x] <(Ik×k,Ik×k)x−(Ik×k,Ik×k)> , where M is a matrix ring of k ×...
متن کاملETRU: NTRU over the Eisenstein integers
NTRU is a public-key cryptosystem based on polynomial rings over Z. Replacing Z with the ring of Eisenstein integers yields ETRU. We prove through both theory and implementation that ETRU is faster and has smaller keys for the same or better level of security than does NTRU.
متن کاملCryptanalysis of NTRU with two Public Keys
NTRU is a fast public key cryptosystem presented in 1996 by Hoffstein, Pipher and Silverman. It operates in the ring of truncated polynomials. In NTRU, a public key is a polynomial defined by the combination of two private polynomials. In this paper, we consider NTRU with two different public keys defined by different private keys. We present a lattice-based attack to recover the private keys a...
متن کامل